A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
The vehicle routing problem with time windows is a hard combinatorial optimization problem which has received considerable attention in the last decades. This paper proposes a two-stage hybrid algorithm for this transportation problem. The algorithm rst minimizes the number of vehicles using simulated annealing. It then minimizes travel cost using a large neighborhood search which may relocate ...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملAdvanced Multi-Stage Local Search Applications to Vehicle Routing Problem with Time Windows: A Review
In many applications of the vehicle routing problem with time windows(VRPTW), the primary objective is defined as the minimization of the number of routes or vehicles. Minimization of the total travel cost is introduced as a secondary objective. Recently, it has been recognized that minimizing the number of routes and the travel cost concurrently often drives a search toward solutions with low ...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2004
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.1030.0049